Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
نویسندگان
چکیده
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for a constant-depth circuit C of size s with an m-bit input x, we obtain the following types
منابع مشابه
6.842 Randomness and Computation
Today we will discuss two more applications of the low degree algorithm. First we will look at constant depth circuits. We will cite a theorem regarding the Fourier concentration of functions computable by constant depth circuits and we will use this theorem as well as the low degree algorithm to show how we can learn constant depth circuits. Second we will begin to develop the theory need to l...
متن کاملGMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits
Secure two-party computation is a rapidly emerging field of research and enables a large variety of privacy-preserving applications such as mobile social networks or biometric identification. In the late eighties, two different approaches were proposed: Yao’s garbled circuits and the protocol of Goldreich-Micali-Wigderson (GMW). Since then, research has mostly focused on Yao’s garbled circuits ...
متن کاملCompiling Low Depth Circuits for Practical Secure Computation
With the rise of practical Secure Multi-party Computation (MPC) protocols, compilers have been developed that create Boolean or Arithmetic circuits for MPC from functionality descriptions in a highlevel language. Previous compilers focused on the creation of size-minimal circuits. However, many MPC protocols, such as GMW and SPDZ, have a round complexity that is dependent on the circuit’s depth...
متن کاملSeparating indexes from data: a distributed scheme for secure database outsourcing
Database outsourcing is an idea to eliminate the burden of database management from organizations. Since data is a critical asset of organizations, preserving its privacy from outside adversary and untrusted server should be warranted. In this paper, we present a distributed scheme based on storing shares of data on different servers and separating indexes from data on a distinct server. Shamir...
متن کاملEfficient Secure Computation with Garbled Circuits
Secure two-party computation enables applications in which participants compute the output of a function that depends on their private inputs, without revealing those inputs or relying on any trusted third party. In this paper, we show the potential of building privacy-preserving applications using garbled circuits, a generic technique that until recently was believed to be too inefficient to s...
متن کامل